On Implementing Push-relabel Method for the Maximum Flow Problem
نویسندگان
چکیده
We study e cient implementations of the push-relabel method for the maximum ow problem. The resulting codes are faster than the previous codes, and much faster on some problem families. The speedup is due to the combination of heuristics used in our implementation. We also exhibit a family of problems for which all known methods seem to have almost quadratic time growth rate. Andrew V. Goldberg was supported in part by NSF Grant CCR-9307045 and a grant from Powell Foundation. This work was done while Boris V. Cherkassky was visiting Stanford University Computer Science Department and supported by the above-mentioned NSF and Powell Foundation grants.
منابع مشابه
The Partial Augment-Relabel Algorithm for the Maximum Flow Problem
The maximum flow problem is a classical optimization problem with many applications. For a long time, HI-PR, an efficient implementation of the highest-label push-relabel algorithm, has been a benchmark due to its robust performance. We propose another variant of the push-relabel method, the partial augment-relabel (PAR) algorithm. Our experiments show that PAR is very robust. It outperforms HI...
متن کاملTwo-Level Push-Relabel Algorithm for the Maximum Flow Problem
We describe a two-level push-relabel algorithm for the maximum flow problem and compare it to the competing codes. The algorithm generalizes a practical algorithm for bipartite flows. Experiments show that the algorithm performs well on several problem families.
متن کاملA New Push-Relabel Algorithm for the Maximum Flow Problem
In this paper, we present a faster push-relabel algorithm for the maximum flow problem on bounded-degree networks with n vertices and m arcs. We show how to compute a maximum flow in O(mn) time. This matches the results of Orlin’s algorithm, which runs in O(mn + m log n) time on general networks (and O(mn) time on bounded-degree networks). Our main result is improving on the generic push-relabe...
متن کاملA New Push-Relabel Algorithm for Sparse Networks
In this paper, we present a new push-relabel algorithm for the maximum flow problem on flow networks with n vertices and m arcs. Our algorithm computes a maximum flow in O(mn) time on sparse networks where m = O(n). To our knowledge, this is the first O(mn) time push-relabel algorithm for the m = O(n) edge case; previously, it was known that push-relabel implementations could find a max-flow in...
متن کامل